Energy-Saving Scheduling for Flexible Job Shop Problem with AGV Transportation Considering Emergencies

نویسندگان

چکیده

Emergencies such as machine breakdowns and rush orders greatly affect the production activities of manufacturing enterprises. How to deal with rescheduling problem after emergencies have high practical value. Meanwhile, under background intelligent manufacturing, automatic guided vehicles are gradually emerging in To disturbances flexible job shop scheduling vehicle transportation, a mixed-integer linear programming model is established. According traits this model, an improved NSGA-II designed, aiming at minimizing makespan, energy consumption workload deviation. improve solution qualities, local search operator based on critical path designed. In addition, crowding distance calculation method used reduce computation complexity algorithm. Finally, validity improvement strategies tested, robustness superiority proposed algorithm verified by comparing it NSGA, SPEA2.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The cas...

متن کامل

Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption

This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...

متن کامل

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

Single Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem

A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Systems

سال: 2023

ISSN: ['2079-8954']

DOI: https://doi.org/10.3390/systems11020103